The approximability of three-dimensional assignment problems with bottleneck objective
نویسندگان
چکیده
We discuss two special cases of the three-dimensional bottleneck assignment problemwhere a certain underlying cost function satisfies the triangle inequality. We present polynomial time 2-approximation algorithms for the broadest class of these special cases, and we prove that (unless P = NP) this factor 2 is best possible even in the highly restricted setting of the Euclidean plane.
منابع مشابه
An algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملOn the Approximability of Multi-level Bottleneck Assignment Problem
We revisit the multi-level bottleneck assignment problem and study the approximability when there are m > 3 sets. We show that with respect to the approximability the problem exhibits an easy to hard transition. More specifically, we give a PTAS to the easiest hard case which is when the alternative edge-sets are complete, and prove that it is NP-hard to approximate the problem to within a rati...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملDAMAGE IDENTIFICATION BY USING MODAL EXPANSION AND TOPOLOGY OPTIMIZATION IN THREE DIMENSIONAL ELASTICITY PROBLEMS
In this paper, topology optimization is utilized for damage detection in three dimensional elasticity problems. In addition, two mode expansion techniques are used to derive unknown modal data from measured data identified by installed sensors. Damages in the model are assumed as reduction of mass and stiffness in the discretized finite elements. The Solid Isotropic Material with Penalization (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Optimization Letters
دوره 4 شماره
صفحات -
تاریخ انتشار 2010